kw.\*:("Code linéaire")
Results 1 to 25 of 1002
Selection :
Linear unequal error protection codes from shorter codesVAN GILS, W. J.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 544-546, issn 0018-9448Article
A new proof of Korzhik's result on burst distributionsSIRI KRISHAN WASAN.Linear algebra and its applications. 1984, Vol 59, pp 115-119, issn 0024-3795Article
Optimal lower bounds for 2-query locally decodable linear codesOBATA, Kenji.Lecture notes in computer science. 2002, pp 39-50, issn 0302-9743, isbn 3-540-44147-6, 12 p.Conference Paper
Binomial coefficient codes over GF(2)DIACONIS, P; GRAHAM, R.Discrete mathematics. 1992, Vol 106-7, pp 181-188, issn 0012-365XArticle
Dual product constructions of Reed―Muller type codesPHELPS, K. T.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 103-106, issn 0018-9448Article
A CLASS OF HIGH RATE CODES FOR BYTE-ORIENTED INFORMATION SYSTEMSSEGUIN GE; ALLARD PE; BHARGAVA VK et al.1983; IEEE TRANSACTIONS ON COMMUNICATIONS; ISSN 0090-6778; USA; DA. 1983; VOL. 31; NO 3; PP. 334-342; BIBL. 8 REF.Article
Sur la complexité d'un problème de codage = On the complexity of a problem of codingLOBSTEIN, A; COHEN, G.Informatique théorique et applications (Imprimé). 1987, Vol 21, Num 1, pp 25-32, issn 0988-3754Article
A reversible code over GF(q)SUNIL KUMAR MUTTOO; SHANKAR LAL.Kybernetika. 1986, Vol 22, Num 1, pp 85-91, issn 0023-5954Article
Binary cyclic codes generated by m1m7VAN LINT, J. H; WILSON, R. M.IEEE transactions on information theory. 1986, Vol 32, Num 2, issn 0018-9448, 283Article
Finite state models in the study of comma-free codesLLEWELLYN, J. A.Computer journal (Print). 1983, Vol 26, Num 4, pp 303-311, issn 0010-4620Article
Rateless codes based on linear congruential recursionsERIKSSON, T; GOERTZ, N.Electronics Letters. 2007, Vol 43, Num 7, pp 402-404, issn 0013-5194, 3 p.Article
Normal basis of finite field GF(2m)PEI, D. Y; WANG, C. C; OMURA, J. K et al.IEEE transactions on information theory. 1986, Vol 32, Num 2, pp 285-287, issn 0018-9448Article
Linear codes for masking memory defectsCHEN, C. L.IEEE transactions on information theory. 1985, Vol 31, Num 1, pp 104-106, issn 0018-9448Article
Signaux de groupe multiplicatifs discrets de leur lien avec les codes de groupesSMOL'YANINOV, V. M.Radiotehnika i èlektronika. 1985, Vol 30, Num 12, pp 2391-2394, issn 0033-8494Article
Further classifications of codes meeting the Griesmer boundHELLESETH, T.IEEE transactions on information theory. 1984, Vol 30, Num 2, pp 395-403, issn 0018-9448Article
Investigation of linear codes possessing some extra propertiesMASOL, Viktoriya.Lecture notes in computer science. 2001, pp 301-306, issn 0302-9743, isbn 3-540-43026-1Conference Paper
The minimal covering radius t[15,6] of a six-dimensional binary linear code of length 15 is equal to 4SIMONIS, J.IEEE transactions on information theory. 1988, Vol 34, Num 5, pp 1344-1345, issn 0018-9448Article
Note sur la notion d'équivalence entre deux codes linéaires = Note on the notion of equivalence between two linear codesMONTPETIT, A.Discrete mathematics. 1987, Vol 65, Num 2, pp 177-185, issn 0012-365XArticle
Reduced-search soft-decision trellis decoding of linear block codesMATIS, K. R; MODESTINO, J. W.IEEE transactions on information theory. 1983, Vol 28, Num 2, pp 349-355, issn 0018-9448Article
Sets of complementary sequencesSARWATE, D. V.Electronics Letters. 1983, Vol 19, Num 18, pp 711-712, issn 0013-5194Article
A General Framework for Applying FGLM Techniques to Linear CodesBORGES-QUINTANA, M; BORGES-TRENARD, M. A; MARTINEZ-MORO, E et al.Lecture notes in computer science. 2006, pp 76-86, issn 0302-9743, isbn 3-540-31423-7, 1Vol, 11 p.Conference Paper
On the covering radius of cyclic linear codes and arithmetic codesHELLESETH, T.Discrete applied mathematics. 1985, Vol 11, Num 2, pp 157-173, issn 0166-218XArticle
An improvement of the Griesmer bound for some small minimum distancesDODUNEKOV, S. M; MANEV, N. L.Discrete applied mathematics. 1985, Vol 12, Num 2, pp 103-114, issn 0166-218XArticle
Good coverings of Hamming spaces with spheresCOHEN, G; FRANKL, P.Discrete mathematics. 1985, Vol 56, Num 2-3, pp 125-131, issn 0012-365XArticle
The complexity of computing the coverning radius of a codeLOUGHLIN, A. M. M.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 800-804, issn 0018-9448Article
